No Coreset, No Cry: II

نویسندگان

  • Michael Edwards
  • Kasturi R. Varadarajan
چکیده

Let P be a set of n points in d-dimensional Euclidean space, where each of the points has integer coordinates from the range [−∆, ∆], for some ∆ > 1. Let ε > 0 be a given parameter. We show that there is subset Q of P , whose size is polynomial in (log ∆/ε), such that for any k slabs that cover Q, their ε-expansion covers P. In this result, k and d are assumed to be constants. The set Q can also be computed efficiently, in time that is roughly n times the bound on the size of Q. Besides yielding approximation algorithms that are linear in n and polynomial in log ∆ for the k-slab cover problem, this result also yields small coresets and efficient algorithms for several other clustering problems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

No, Coreset, No Cry

We show that coresets do not exist for the problem of 2-slabs in IR, thus demonstrating that the natural approach for solving approximately this problem efficiently is infeasible. On the positive side, for a point set P in IR, we describe a near linear time algorithm for computing a (1+ε)-approximation to the minimum width 2-slab cover of P . This is a first step in providing an efficient appro...

متن کامل

Bayesian Coreset Construction via Greedy Iterative Geodesic Ascent

Coherent uncertainty quantification is a key strength of Bayesian methods. But modern algorithms for approximate Bayesian posterior inference often sacrifice accurate posterior uncertainty estimation in the pursuit of scalability. This work shows that previous Bayesian coreset construction algorithms—which build a small, weighted subset of the data that approximates the full dataset—are no exce...

متن کامل

Coresets For Monotonic Functions with Applications to Deep Learning

Coreset (or core-set) in this paper is a small weighted subset Q of the input set P with respect to a given monotonic function f : R → R that provably approximates its fitting loss ∑ p∈P f(p · x) to any given x ∈ R. Using Q we can obtain approximation to x∗ that minimizes this loss, by running existing optimization algorithms on Q. We provide: (i) a lower bound that proves that there are sets w...

متن کامل

Specificity and Combinatorial Effects of Bacillus Thuringiensis Cry Toxins in the Context of GMO Environmental Risk Assessment

Stacked GM crops expressing up to six Cry toxins from Bacillus thuringiensis (Bt) are today replacing the formerly grown single-transgene GM crop varieties. Stacking of multiple Cry toxins not only increase the environmental load of toxins but also raise the question on how possible interactions of the toxins can be assessed for risk assessment, which is mandatory for GM crops. However, no oper...

متن کامل

Quantitative Assessment of Cry in Term and Preterm Infants: Long-Time Average Spectrum Analysis

Long-time average spectrum (LTAS) was used to analyze the cry utterance of 26 infants under four months old; 16 of them were full-term and the other 10 infants were preterm. The results of first spectral peak (FSP), mean spectral energy (MSE), spectral tilt (ST), high frequency energy (HFE) were used to compare the cry production between term and preterm infants. In addition, cry duration and p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005